Graded properties of unary and binary fuzzy connectives
نویسنده
چکیده
The paper studies basic graded properties of unary and binary fuzzy connectives, i.e., unary and binary operations on the set of truth degrees of a background fuzzy logic extending the logic MTL of left-continuous t-norms. The properties studied in this paper are graded generalizations of monotony, Lipschitz continuity, null and unit elements, idempotence, commutativity, and associativity. The paper elaborates the initial study presented in previous papers and focuses mainly on parameterization of graded properties by conjunction-multiplicities of subformulae in the defining formulae, preservation of graded properties under compositions and slight variations of fuzzy connectives, the values of graded properties for basic connectives of the ground logic, and the dependence of the values on the ground logic. The results are proved in the formal framework of higher-order fuzzy logic MTL, also known as Fuzzy Class Theory (FCT). General theorems provable in FCT are illustrated on several semantic examples.
منابع مشابه
Graded dominance and related graded properties of fuzzy connectives
This text is a further elaboration of the previous research report [5]. Graded properties of binary and unary connectives valued in MTL4-algebras are studied in the framework of Fuzzy Class Theory (or higher-order fuzzy logic) FCT, which serves as a tool for easy derivation of graded theorems. The properties studied include graded monotonicity, a generalized Lipschitz property, commutativity, a...
متن کاملTruth-depressing hedges and BL-logic
We show a complete axiomatization of unary connectives interpreted by monotone and superdiagonal truth functions, so-called truth-depressing hedges. These connectives formalize linguistic hedges like “slightly true” and “more or less”. We follow ideas of [11] and show that BLvt-logic can be enriched by a unary connective for which we can establish strong completeness with respect to the desired...
متن کاملFuzzy logics with truth hedges revisited
In this paper we build upon previous works of Hájek and Vychodil on the axiomatization of truthstressing and depressing hedges as expansions of BL logic by new unary connectives. They show that their logics are chain-complete, but standard completeness is only proved for the expansions over Gödel logic. We propose weaker axiomatizations that have as main advantages the preservation of standard ...
متن کاملMultimodal Linguistic Inference
In this paper we compare grammatical inference in the context of simple and of mixed Lambek systems. Simple Lambek systems are obtained by taking the logic of residuation for a family of multiplicative connectives =; ; n, together with a package of structural postulates characterizing the resource management properties of the connective. Diierent choices for Associativity and Commutativity yiel...
متن کاملA logical approach to fuzzy truth hedges
The starting point of this paper are the works of Hájek and Vychodil on the axiomatization of truth-stressing and depressing hedges as expansions of Hájek's BL logic by new unary connectives. They showed that their logics are chain-complete, but standard completeness was only proved for the expansions over Gödel logic. We propose weaker axiomatizations over an arbitrary core fuzzy logic which h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fuzzy Sets and Systems
دوره 202 شماره
صفحات -
تاریخ انتشار 2012